Spherical Means and Pinned Distance Sets

نویسندگان

  • DANIEL OBERLIN
  • RICHARD OBERLIN
چکیده

We use mixed norm estimates for the spherical averaging operator to obtain some results concerning pinned distance sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The generalized Erdös-Falconer distance problems in vector spaces over finite fields

In this paper we study the generalized Erdös-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular, we develop a simple formula for estimating the cardinality of distance sets determined by diagonal polynomials. As a result, we generalize the spherical dis...

متن کامل

On distance measures for well-distributed sets

In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been classically used to study this problem. We conjecture that a majorant for the spherical means suffices to prove the distance conjecture(s) in this setting. For a ...

متن کامل

Simplices and Sets of Positive Upper Density in R

We prove an extension of Bourgain’s theorem on pinned distances in measurable subset of R2 of positive upper density, namely Theorem 1′ in [1], to pinned non-degenerate k-dimensional simplices in measurable subset of Rd of positive upper density whenever d ≥ k + 2 and k is any positive integer.

متن کامل

An Improved K-means Algorithm Based on Structure Features

In K-means clustering, we are given a set of n data points in multidimensional space, and the problem is to determine the number k of clusters. In this paper, we present three methods which are used to determine the true number of spherical Gaussian clusters with additional noise features. Our algorithms take into account the structure of Gaussian data sets and the initial centroids. These thre...

متن کامل

Fuzzy C-Means Algorithm Based on Standard Mahalanobis Distances

Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014